Compact quotients of large domains in complex projective space

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Quotients of Hypersurfaces in Weighted Projective Space

In [1] some quotients of one-parameter families of Calabi-Yau varieties are related to the family of Mirror Quintics by using a construction due to Shioda. In this paper, we generalize this construction to a wider class of varieties. More specifically, let A be an invertible matrix with non-negative integer entries. We introduce varieties XA and MA in weighted projective space and in P, respect...

متن کامل

Pseudo Ricci symmetric real hypersurfaces of a complex projective space

Pseudo Ricci symmetric real hypersurfaces of a complex projective space are classified and it is proved that there are no pseudo Ricci symmetric real hypersurfaces of the complex projective space CPn for which the vector field ξ from the almost contact metric structure (φ, ξ, η, g) is a principal curvature vector field.

متن کامل

Holomorphic Projection and Duality for Domains in Complex Projective Space

We show that the efficiency of a natural pairing between certain projectively invariant Hardy spaces on dual strongly C-linearly convex real hypersurfaces in complex projective space is measured by the norm of the corresponding Leray transform.

متن کامل

pseudo ricci symmetric real hypersurfaces of a complex projective space

pseudo ricci symmetric real hypersurfaces of a complex projective space are classified and it is proved that there are no pseudo ricci symmetric real hypersurfaces of the complex projective space cpn for which the vector field ξ from the almost contact metric structure (φ, ξ, η, g) is a principal curvature vector field.

متن کامل

Compact Representations of Search in Complex Domains

We consider the problem of searching in complex domains for a buggy element. The structure of the domain determines the set of possible queries at every stage of the search. An important type of search domain is a Directed Acyclic Graph (DAG), where one can query every sub-graph. In this work we focus on reducing the number of sets required to represent a search domain. Our results include: Exa...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Annales de l’institut Fourier

سال: 1998

ISSN: 0373-0956

DOI: 10.5802/aif.1616